An improved method for solving Hybrid Influence Diagrams
نویسندگان
چکیده
منابع مشابه
Solving Hybrid Influence Diagrams with Deterministic Variables
We describe a framework and an algorithm for solving hybrid influence diagrams with discrete, continuous, and deterministic chance variables, and discrete and continuous decision variables. A continuous chance variable in an influence diagram is said to be deterministic if its conditional distributions have zero variances. The solution algorithm is an extension of Shenoy’s fusion algorithm for ...
متن کاملA forward-backward Monte Carlo method for solving influence diagrams
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this is a primary issue when processing real-world models. We shall propose an approximate inference algorithm to deal with very large models. For such models, it may be unfeasible to achieve an exact solution. This anytim...
متن کاملAn improved collocation method based on deviation of the error for solving BBMB equation
In this paper, we improve b-spline collocation method for Benjamin-Bona-Mahony-Burgers (BBMB) by using defect correction principle. The exact finite difference scheme is used to find defect and the defect correction principle is used to improve collocation method. The method is tested on somemodel problems and the numerical results have been obtained and compared.
متن کاملSolving influence diagrams: Exact algorithms
Influence diagrams were developed as a graphical representation for formulating a decision analysis model, facilitating communication between the decision maker and the analyst [1]. We show several approaches for evaluating influence diagrams, determining the optimal strategy for the decision maker and the value or certain equivalent of the decision situation when that optimal strategy is appli...
متن کاملSolving Limited Memory Influence Diagrams
We present a new algorithm for exactly solving decision making problems represented as influence diagrams. We do not require the usual assumptions of no forgetting and regularity; this allows us to solve problems with simultaneous decisions and limited information. The algorithm is empirically shown to outperform a state-of-the-art algorithm on randomly generated problems of up to 150 variables...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2018
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2018.01.006